Efficient Approximation of Optimal High-Order Kinematic Trajectories

نویسندگان

  • John G. Mooney
  • Eric N. Johnson
چکیده

A method for efficiently planning one-dimensional pop-limited trajectories is presented, along with a direct method for synchronizing trajectories across multiple dimensions. This heuristic is designed for a double integrator utilizing acceleration commands passed through a 4th-order cascaded filter, the model for which is presented along with the system solution for an arbitrary time step and derivative limits. Examples for trajectories generated in both one and two dimensions are shown, with comparison to an iterative solver which searches for the exact optimal solution. The presented algorithm shows drastically lower computational requirements than the iterative solver, with very little cost in accuracy. Benefits and limitations of this approach are discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Successive dynamic programming and subsequent spline optimization for smooth time optimal robot path tracking

The time optimal path tracking for industrial robots regards the problem of generating trajectories that follow predefined end-effector (EE) paths in shortest time possible taking into account kinematic and dynamic constraints. The complicated tasks used in industrial applications lead to very long EE paths. At the same time smooth trajectories are mandatory in order to increase the service lif...

متن کامل

Optimal trajectories for kinematic planar rigid bodies with switching costs

The optimal trajectory with respect to some metric for a system with a discrete set of controls may require very many switches between controls, or even infinitely many, a phenomenon called chattering; this can be problematic for existing motion planning algorithms that plan using a finite set of motion primitives. One remedy is to add some penalty for switching between controls. This paper exp...

متن کامل

Thrust - Limited Optimal Three - Dimensional Spacecraft Trajectories

Several optimal three-dimensional orbital transfer problems are solved for thrust-limited spacecrafts using collocation and nonlinear programming techniques. The solutions for full nonlinear equations of motion are obtained where the integrals of the free Keplerian motion in three dimensions are utilized for coasting arcs. In order to limit the solution space, interior-point constraints are use...

متن کامل

Reliable Designing of Capacitated Logistics Network with Multi Configuration Structure under Disruptions: A Hybrid Heuristic Based Sample Average Approximation Algorithm

We consider the reliable multi configuration capacitated logistics network design problem (RMCLNDP) with system disruptions, concerned with facilities locating, transportation links constructing, and also allocating their limited capacities to the customers in order to satisfy their demands with a minimum expected total cost (including locating costs, link constructing costs, as well as expecte...

متن کامل

Segmenting sign language into motor primitives with Bayesian binning

The endpoint trajectories of human movements fulfill characteristic power laws linking velocity and curvature. The parameters of these power laws typically vary between different segments of longer action sequences. These parameters might thus be exploited for the unsupervised segmentation of actions into movement primitives. For the example of sign language we investigate whether such segments...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015